On Some Algorithmic Problems Regarding the Hairpin Completion
نویسندگان
چکیده
It is known that a single stranded DNA molecule might produce a hairpin structure due to two biological principles, namely Watson-Crick complementarity and annealing. In many DNA-based algorithms, these DNA molecules cannot be used in the subsequent computations. Hairpin or hairpin-free DNA structures have numerous applications to DNA computing and molecular genetics. Suggested by the two aforementioned biological phenomena together with that of lengthening DNA by polymerases, we defined in [1] a new unary operation called hairpin completion. This operation might be defined informally as follows:
منابع مشابه
On the Hairpin Incompletion
Hairpin completion and its variant called bounded hairpin completion are operations on formal languages, inspired by a hairpin formation in molecular biology. Another variant called hairpin lengthening has been recently introduced and studied on the closure properties and algorithmic problems concerning several families of languages. In this paper, we introduce a new operation of this kind, cal...
متن کاملHairpin Lengthening
The hairpin completion is a natural operation of formal languages which has been inspired by molecular phenomena in biology and by DNA-computing. We consider here a new variant of the hairpin completion, called hairpin lengthening, which seems more appropriate for practical implementation. The variant considered here concerns the lengthening of the word that forms a hairpin structure, such that...
متن کاملTwo complementary operations inspired by the DNA hairpin formation: Completion and reduction
We consider two complementary operations: Hairpin completion introduced in [D. Cheptea, C. Martin-Vide, V. Mitrana, A new operation on words suggested by DNA biochemistry: Hairpin completion, in: Proc. Transgressive Computing, 2006, pp. 216–228] with motivations coming from DNA biochemistry and hairpin reduction as the inverse operation of the hairpin completion. Both operations are viewed here...
متن کاملIterated Hairpin Completions of Non-crossing Words
Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or more precisely a singleton language) is always a context-sensitive language and for some words it is known to be non-context-free. However, it is unknown whether regularity of iterated hairpin completion of a given word is decid...
متن کاملOn the Regularity of Iterated Hairpin Completion of a Single Word
Hairpin completion is an abstract operation modeling a DNA bio-operation which receives as input a DNA strand w = xαyα, and outputs w′ = xαyᾱx, where x denotes the WatsonCrick complement of x. In this paper, we focus on the problem of finding conditions under which the iterated hairpin completion of a given word is regular. According to the numbers of words α and α that initiate hairpin complet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 2006